Subgradient method

Results: 57



#Item
11Topics in convex and mixed binary linear optimization Emil Gustavsson Thesis for the degree of Doctor of Philosophy to be defended in public on Friday

Topics in convex and mixed binary linear optimization Emil Gustavsson Thesis for the degree of Doctor of Philosophy to be defended in public on Friday

Add to Reading List

Source URL: gupea.ub.gu.se

Language: English - Date: 2015-05-08 21:34:42
12

PDF Document

Add to Reading List

Source URL: www.mat.univie.ac.at

Language: English - Date: 2015-05-09 05:30:40
13Rates of Convergence for Greedy Gossip with Eavesdropping ¨ Deniz Ustebay, Boris Oreshkin, Mark Coates, and Michael Rabbat Department of Electrical and Computer Engineering

Rates of Convergence for Greedy Gossip with Eavesdropping ¨ Deniz Ustebay, Boris Oreshkin, Mark Coates, and Michael Rabbat Department of Electrical and Computer Engineering

Add to Reading List

Source URL: www.tsp.ece.mcgill.ca

Language: English - Date: 2008-10-01 12:20:17
141 Greedy Gossip with Eavesdropping ? ¨ Deniz Ustebay

1 Greedy Gossip with Eavesdropping ? ¨ Deniz Ustebay

Add to Reading List

Source URL: www.tsp.ece.mcgill.ca

Language: English - Date: 2011-03-22 10:34:09
15Noname manuscript No. (will be inserted by the editor) An optimal subgradient algorithm with subspace search for costly convex optimization problems Masoud Ahookhosh · Arnold Neumaier

Noname manuscript No. (will be inserted by the editor) An optimal subgradient algorithm with subspace search for costly convex optimization problems Masoud Ahookhosh · Arnold Neumaier

Add to Reading List

Source URL: www.mat.univie.ac.at

Language: English - Date: 2015-04-01 13:26:40
16Greedy Gossip with Eavesdropping

Greedy Gossip with Eavesdropping

Add to Reading List

Source URL: www.tsp.ece.mcgill.ca

Language: English - Date: 2008-10-10 15:22:25
17An Approximate Dynamic Programming Approach to a Communication Constrained Sensor Management Problem ∗ Laboratory Jason L. Williams,∗ John W. Fisher III† and Alan S. Willsky∗

An Approximate Dynamic Programming Approach to a Communication Constrained Sensor Management Problem ∗ Laboratory Jason L. Williams,∗ John W. Fisher III† and Alan S. Willsky∗

Add to Reading List

Source URL: ssg.mit.edu

Language: English - Date: 2012-02-01 13:45:48
18New Approximation Algorithms for Minimum Enclosing Convex Shapes Ankan Saha∗ S.V. N. Vishwanathan†

New Approximation Algorithms for Minimum Enclosing Convex Shapes Ankan Saha∗ S.V. N. Vishwanathan†

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2010-11-03 13:53:29
19THE SPEED OF GREED: CHARACTERIZING MYOPIC GOSSIP THROUGH NETWORK VORACITY ¨ Deniz Ustebay, Boris Oreshkin, Mark Coates, and Michael Rabbat Department of Electrical and Computer Engineering, McGill University,

THE SPEED OF GREED: CHARACTERIZING MYOPIC GOSSIP THROUGH NETWORK VORACITY ¨ Deniz Ustebay, Boris Oreshkin, Mark Coates, and Michael Rabbat Department of Electrical and Computer Engineering, McGill University,

Add to Reading List

Source URL: www.tsp.ece.mcgill.ca

Language: English - Date: 2009-04-06 18:40:20
20Fair subdivision of Multi-Robot Tasks Juan Camilo Gamboa Higuera1 , and Gregory Dudek1 . Abstract— We study the problem of distributing a single global task between a group of heterogeneous robots. We view this problem

Fair subdivision of Multi-Robot Tasks Juan Camilo Gamboa Higuera1 , and Gregory Dudek1 . Abstract— We study the problem of distributing a single global task between a group of heterogeneous robots. We view this problem

Add to Reading List

Source URL: www.cim.mcgill.ca

Language: English - Date: 2013-09-11 11:51:39